Parrondo Paradox in Scale Free Networks

نویسنده

  • Norihito Toyota
چکیده

Parrondo’s paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo’s games with paradoxical property have been introduced. In this paper, I examine whether Parrondo’s paradox occurs or not in scale free networks. Two models are discussed by some theoretical analyses and computer simulations. As a result, I prove that Parrondo’s paradox occurs only in the second model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Does Parrondo Paradox occur in Scale Free Networks? -A simple Consideration-

Parrondo's paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo's games apparently with paradoxical property have been introduced; history dependence, one dimensional line, two dimensional lattice and so on. In this art...

متن کامل

Second Parrondo's Paradox in Scale Free Networks

Parrondo’s paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo’s games apparently with the same paradoxical property have been introduced [5]; history dependence, one dimensional line, two dimensional...

متن کامل

The friendship paradox in scale-free networks

Our friends have more friends than we do. That is the basis of the friendship paradox. In mathematical terms, the mean number of friends of friends is higher than the mean number of friends. In the present study, we analyzed the relationship between the mean degree of vertices (individuals), 〈k〉, and the mean number of friends of friends, 〈kFF 〉, in scale-free networks with degrees ranging from...

متن کامل

Inefficiency of voting in Parrondo games

We study a modification of the so-called Parrondo’s paradox where a large number of individuals choose the game they want to play by voting. We show that it can be better for the players to vote randomly than to vote according to their own benefit in one turn. The former yields a winning tendency while the latter results in steady losses. An explanation of this behaviour is given by noting that...

متن کامل

Limit theorems for Parrondo’s paradox

That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo’s paradox. We establish a strong law of large numbers and a central limit theorem for the Parrondo player’s sequence of profits, both in a one-parameter family of capital-dependent games and in a two-parameter family of history-dependent games...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1206.2733  شماره 

صفحات  -

تاریخ انتشار 2012